PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
نویسندگان
چکیده
منابع مشابه
Multicommodity Network Flow Problems
In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...
متن کاملDewey a Scaling Algorithm for Multicommodity Flow Problems a Scaling Algorithm for Multicommodity Flow Problems
We present a penalty-based algorithm that solves the multicommodity flow problem as a sequence of a fmite number of scaling phases. In the 8-scaling phase the algorithm determines an eoptimal solution, that is, one in which complementary slackness conditions are satisfied to within 8. We analyze the performance of the algorithm from both the theoretical and practical perspectives.
متن کاملA Scaling Algorithm for Multicommodity Flow Problems
Due to the condition of the original material, there are unavoidable flaws in this reproduction. We have made every effort to provide you with the best copy available. If you are dissatisfied with this product and find it unusable, please contact Document Services as soon as possible.
متن کاملGlobal scaling of the Proximal Decomposition algorithm for convex multicommodity flow problems
We analyze here the behaviour of the Proximal Decomposition algorithm with global and adaptive scaling. The algorithm is well adapted to solve convex multicommodity flow problems that arise in Network Routing problems with QoS requirements. Numerical tests performed on quadratic models confirm that adaptive global scaling subsumes former scaling strategies with one or many parameters.
متن کاملPerturbed Proximal Primal Dual Algorithm for Nonconvex Nonsmooth Optimization
In this paper we propose a perturbed proximal primal dual algorithm (PProx-PDA) for an important class of optimization problems whose objective is the sum of smooth (possibly nonconvex) and convex (possibly nonsmooth) functions subject to a linear equality constraint. This family of problems has applications in a number of statistical and engineering applications, for example in high-dimensiona...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 1994
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.37.297